Heuristic Sequence Selection for Inventory Routing Problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem

In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...

متن کامل

A Constructive Heuristic for a Multi-Product Inventory Routing Problem

Inventory management and transportation issues are very important problems in distribution companies. Simultaneous l optimization of these problems realizes significant savings for all partners of the supply chain. One of the problems that should be addressed in the scope of simultaneous sl optimization is the inventory routing problem (IRP). IRP deals with how to manage the supply goods from o...

متن کامل

A Hybrid Heuristic for an Inventory Routing Problem

We consider an inventory routing problem in discrete time where a supplier has to serve a set of customers over a time horizon. A capacity constraint for the inventory is given for each customer and the service cannot cause any stock-out situation. Two different replenishment policies are considered, the order-up-to level and the maximum level policies. A single vehicle with a given capacity is...

متن کامل

Heuristic approaches for the inventory-routing problem with backlogging

We study an inventory-routing problem in which multiperiod inventory holding, backlogging, and vehicle routing decisions are to be taken for a set of customers who receive units of a single item from a depot with infinite supply. We consider a case in which the demand at each customer is deterministic and relatively small compared to the vehicle capacity, and the customers are located closely s...

متن کامل

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Science

سال: 2020

ISSN: 0041-1655,1526-5447

DOI: 10.1287/trsc.2019.0934